Solving Graph Coloring Problems with the Douglas-Rachford Algorithm
نویسندگان
چکیده
منابع مشابه
Solving Graph Coloring Problems Using Cultural Algorithm
This paper proposes a new method based on the cultural algorithm to solve graph coloring problem (GCP). Graph coloring problem involves finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. In this paper various components of cultural algorithm have been implemented to solve GCP with a self adaptive behavior in an efficient manner...
متن کاملSolving Graph Coloring Problems Using Cultural Algorithm
This paper proposes a new method based on the cultural algorithm to solve graph coloring problem (GCP). Graph coloring problem involves finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. In this paper various components of cultural algorithm have been implemented to solve GCP with a self adaptive behavior in an efficient manner...
متن کاملDouglas-Rachford splitting for nonconvex feasibility problems
We adapt the Douglas-Rachford (DR) splitting method to solve nonconvex feasibility problems by studying this method for a class of nonconvex optimization problem. While the convergence properties of the method for convex problems have been well studied, far less is known in the nonconvex setting. In this paper, for the direct adaptation of the method to minimize the sum of a proper closed funct...
متن کاملSolving Graph Coloring Problems Using Cultural Algorithms
In this paper, we combine a novel Sequential Graph Coloring Heuristic Algorithm (SGCHA) with a non-systematic method based on a cultural algorithm to solve the graph coloring problem (GCP). The GCP involves finding the minimum number of colors for coloring the graph vertices such that adjacent vertices have distinct colors. In our solving approach, we first use an estimator which is implemented...
متن کاملSolving Graph Coloring Problems with Abstraction and Symmetry
This paper introduces a general methodology, based on abstraction and symmetry, that applies to solve hard graph edge-coloring problems and demonstrates its use to provide further evidence that the Ramsey number R(4, 3, 3) = 30. The number R(4, 3, 3) is often presented as the unknown Ramsey number with the best chances of being found “soon”. Yet, its precise value has remained unknown for more ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Set-Valued and Variational Analysis
سال: 2018
ISSN: 1877-0533,1877-0541
DOI: 10.1007/s11228-017-0461-4